Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
نویسندگان
چکیده
منابع مشابه
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that construction, the maximal number of nonterminals simultaneously rewritten during a derivation step depends on many factors, such as the cardinality of the alphabet of the generated language and the structure of the generate...
متن کاملOn the descriptional complexity of scattered context grammars
This paper proves that every recursively enumerable language is generated by a scattered context grammar with no more than four nonterminals and three non-context-free productions. In its conclusion, it gives an overview of the results and open problems concerning scattered context grammars and languages.
متن کاملDescriptional Complexity of Grammars Regulated by Context Conditions
This paper improves several well-known results concerning the descriptional complexity of grammars regulated by context conditions. Specifically, it proves that every recursively enumerable language is generated (A) by a context-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals, (B) by a generalized forbidding grammar of degree two with ...
متن کاملNonterminal complexity of tree controlled grammars
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree controlled grammars without erasing rules leads to an infinite hierarchy of families of tree controlled languages, while every recursively enumerable language can be generated by a tree controlled grammar with erasing rules and at most nine nonterminals. © 2011 Elsevie...
متن کاملOn Descriptional Complexity of Partially Parallel Grammars
This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a four-nonterminal scattered context grammar with no more than four non-context-free productions, (ii) by a two-nonterminal multisequential grammar with no more than two selectors, or (iii) by a three-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2009
ISSN: 2075-2180
DOI: 10.4204/eptcs.3.17